Genetic Algorithm Based Solution for TSP on a Sphere
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm Based Solution for Tsp on a Sphere
The Traveling Salesman Problem (TSP) is one of the extensively studied combinatorial optimization problems. Various exact or approximation algorithms are devised for solving Euclidean TSP that determine the shortest route through a given set of points in 3-dimensional Euclidean space. In this paper, we proposed a genetic algorithm-based solution for TSP where all points are on the surface of a ...
متن کاملCongressional Districting Using a TSP-Based Genetic Algorithm
The drawing of congressional districts by legislative bodies in the United States creates a great deal of controversy each decade as political parties and special interest groups attempt to divide states into districts beneficial to their candidates. The genetic algorithm presented in this paper attempts to find a set of compact and contiguous congressional districts of approximately equal popu...
متن کاملCongressional Redistricting Using A TSP-based Genetic Algorithm
A redistricting plan partitions a state’s tracts (often counties or census tracts) into a set of congressional districts. Special interests attempt to mold districts to their political advantage, often inviting judicial review in the process. The quality of a plan has been judged by the courts using a fairly standard set of criteria: (1) the districts must be contiguous, (2) the districts must ...
متن کاملA Genetic Algorithm for Choice-Based Network Revenue Management
In recent years, enriching traditional revenue management models by considering the customer choice behavior has been a main challenge for researchers. The terminology for the airline application is used as representative of the problem. A popular and an efficient model considering these behaviors is choice-based deterministic linear programming (CDLP). This model assumes that each customer bel...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 2009
ISSN: 2297-8747
DOI: 10.3390/mca14030219